import java.util.HashMap;
import java.util.Map;


public class fibonacci {
	public static void main(String[] args) {
		System.out.println(fibonacciFind(10));
	}
	
	public static Map<Integer, Integer> fibMap = new HashMap<Integer, Integer>();
	
	public static int fibonacciFind(int n){
		if(n == 0 || n == 1){
			return 1;
		}
		else if(fibMap.containsKey(n)){
			return fibMap.get(n);
		}
		else{
			int res = fibonacciFind(n-1) + fibonacciFind(n-2);
			fibMap.put(n, res);
			return res;
		}
	}

}
